Cancellative pairs of families of sets

نویسندگان

  • Ron Holzman
  • János Körner
چکیده

A pair (~, ~) of families of subsets of an n-element set X is cancellative if, for all A, A' e .~ and B, B' E ~, the following conditions hold: A\B = A ' \ B ~ A =A' and BkA =B'kA~B = B'. We prove that every such pair satisfies I.~11~1 < 0 ~, where 0 ~2.3264. This is related to a conjecture of ErdSs and Katona on cancellative families and to a conjecture of Simonyi on recovering pairs. For the latter, our result gives the best known upper bound.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Construction for Cancellative Families of Sets

Following [2], we say a family, H , of subsets of a n-element set is cancellative if A∪B = A∪C implies B = C when A,B,C ∈ H . We show how to construct cancellative families of sets with c2 elements. This improves the previous best bound c2 and falsifies conjectures of Erdös and Katona [3] and Bollobas [1]. AMS Subject Classification. 05C65 We will look at families of subsets of a n-set with the...

متن کامل

Strongly Cancellative and Recovering Sets on Lattices

We use information theory to study recovering sets RL and strongly cancellative sets CL on different lattices. These sets are special classes of recovering pairs and cancellative sets previously discussed in the papers of Simonyi, Frankl, and Füredi. We mainly focus on the lattices Bn and D k l . Specifically, we find upper bounds and constructions for the sets RBn , CBn , and CDk l .

متن کامل

On Cancellative Set Families

A family of subsets of an n-set is 2-cancellative if for every four-tuple {A, B, C, D} of its members A ∪B ∪C = A ∪B ∪D implies C = D. This generalizes the concept of cancellative set families, defined by the property that A ∪B 6= A ∪C for A, B, C all different. The asymptotics of the maximum size of cancellative families of subsets of an n-set is known, (Tolhuizen [7]). We provide a new upper ...

متن کامل

Union-free Hypergraphs and Probability Theory

Notice that the upper bound is an immediate consequence of (I<;J) :s;; 2n. To prove the lower bound we use an algebraic construction which is a modification of a construction of Babai and S6s [1]. How a family of sets can fail to have the union-free property? There are essentially two possibilities: (a) there are four distinct sets A, B, C, D with Au B =CuD. (b) there are three distinct sets A,...

متن کامل

Local Computation with Gaussian Potentials

Gaussian or multivariate normal distributions are very popular and important probability models. Gaussian potentials [5] are multivariate normal density functions. Such a distribution is often given as a product of conditional Gaussian densities, which are more general than Gaussian potentials. These are related to Gaussian hints [11] and Gaussian belief functions [9, 10]. Gaussian potentials, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 1995